Proving Properties of Neural Networks with

| Graph transformations ooer a unifying framework to formalize Neural Networks together with their corresponding training algorithms. It is straightforward to describe also topology changing training algorithms with the help of these transformations. One of the beneets using this formal framework is the support for proving properties of the training algorithms. A training algorithm for Proba-bilistic Neural Networks is used as an example to prove its termination and correctness on the basis of the corresponding graph rewriting rules.